An Efficient Nondominated Sorting Algorithm for Large Number of Fronts
نویسندگان
چکیده
منابع مشابه
An Improved Nondominated Sorting Algorithm
This paper presents a new procedure for the nondominated sorting with constraint handling to be used in a multiobjective evolutionary algorithm. The strategy uses a sorting algorithm and binary search to classify the solutions in the correct level of the Pareto front. In a problem with m objective functions, using n solutions in the population, the original nondominated sorting algorithm, used ...
متن کاملOptimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II
The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...
متن کاملAn Improved Nondominated Sorting Multiobjective Genetic Algorithm and Its Application
The nondominated sorting genetic algorithm with elitism (NSGA-II) is widely used due to its good performance on solving multiobjective optimization problems. In each iteration of NSGA-II, truncation selection is performed based on the rank and crowding distance of each solution. There are, however, drawbacks in this process. These drawbacks to some extent cause overlapping solutions in the popu...
متن کاملA Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...
متن کاملAn efficient external sorting algorithm
This paper presents an optimal external sorting algorithm for two-level memory model. Our method is different from the traditional external merge sort and it uses the sampling information to reduce the disk I/Os in the external phase. The algorithm is efficient, simple and it makes a good use of memory available in the recent computer environment. Under the certain memory constraint, this algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2019
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2017.2789158